Distributionally robust optimization for the berth allocation problem under uncertainty

Berth allocation problems are amongst the most important occurring in port terminals, and they greatly affected by several unpredictable events. As a result, study of these under uncertainty has been target more researchers. Following this research line, we consider berth problem uncertain handling times. A distributionally robust two-stage model is presented to minimize worst-case expected sum delays with respect set possible probability distributions The solutions proposed obtained an exact decomposition algorithm for which improvements discussed. An adaptation case where assumption relatively complete recourse fails also presented. Extensive computational tests reported evaluate effectiveness approach compare those resulting from stochastic approaches. • introduced problem. Wasserstein distance used ambiguity set. developed solve Strategies improve performance solution procedure Computational results show applicability